Fast Approximation of Centrality
نویسندگان
چکیده
منابع مشابه
Local Approximation of Centrality Measures
Centrality measures provide a means to differentiate the importance of vertices in a network. These measures are mathematically clear, but the algorithms to compute them often have quadratic time complexity or worse. This may lead to significant computational challenges when applied to large networks. In this paper, we propose a local strategy for three frequently used centrality measures: (i) ...
متن کاملBetter Approximation of Betweenness Centrality
Estimating the importance or centrality of the nodes in large networks has recently attracted increased interest. Betweenness is one of the most important centrality indices, which basically counts the number of shortest paths going through a node. Betweenness has been used in diverse applications, e.g., social network analysis or route planning. Since exact computation is prohibitive for large...
متن کاملFully-Dynamic Approximation of Betweenness Centrality
Betweenness is a well-known centrality measure that ranks the nodes of a network according to their participation in shortest paths. Since an exact computation is prohibitive in large networks, several approximation algorithms have been proposed. Besides that, recent years have seen the publication of dynamic algorithms for efficient recomputation of betweenness in evolving networks. In previou...
متن کاملA Computationally Efficient Approximation of Beta Centrality
Much attention has been focused on developing methods of assessing centrality and power in networks, with particular interest focused on recursive measures that view the status of a node as a function of the status of other nodes. Although such measures have been widely adopted in both academic research and commercial applications, they are computationally intensive and subject to misspecificat...
متن کاملDistributed Local Multi-Aggregation and Centrality Approximation
We study local aggregation and graph analysis in distributed environments using the message passing model. We provide a flexible framework, where each of the nodes in a set S–which is a subset of all nodes in the network–can perform a large range of common aggregation functions in its k-neighborhood. We study this problem in the CONGEST model, where in each synchronous round, every node can tra...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Graph Algorithms and Applications
سال: 2004
ISSN: 1526-1719
DOI: 10.7155/jgaa.00081